Counting Square-Free Numbers
نویسنده
چکیده
The main topic of this contribution is the problem of counting square-free numbers not exceeding n. Before this work we were able to do it in time Õ( √ n). Here, the algorithm with time complexity Õ(n) and with memory complexity Õ(n) is presented. Additionally, a parallel version is shown, which achieves full scalability. As of now the highest computed value was for n = 10. Using our implementation we were able to calculate the value for n = 10 on a cluster.
منابع مشابه
The 3-Part of Class Numbers of Quadratic Fields
In 1801, Gauss published Disquisitiones Arithmeticae, which, among many other things, develops genus theory, describing the divisibility by 2 of class numbers of quadratic fields. In the centuries since this work, the divisibility properties of class numbers by integers g ≥ 3 have largely remained mysterious. In particular, the problem of bounding the g-part hg(D) of class numbers of quadratic ...
متن کاملOn the Enumeration of Circulant Graphs of Prime Power and Square Free Orders
The aim of this work is twofold: to unify, systematize and extend the known results of the analytical (i.e. formula-wise) counting of directed and undirected circulant graphs with a prime or, more generally, square-free number of vertices; to develop a general combinatorial framework for the counting of nonisomorphic circulant graphs with pk vertices, p odd prime, k 2. The general problem of co...
متن کاملBases and Nonbases of Square-Free Integers
A basis is a set A of nonnegative integers such that every sufficiently large integer n can be represented in the form n = a + a i with a , ai e A . If A is a basis, but no proper subset of A is a basis, then A is a minimal basis . A nonbasis is a set of nonnegative integers that is not a basis, and a nonbasis A is maximal if every proper superset of A is a basis . In this paper, minimal bases ...
متن کاملSieve Methods
Preface Sieve methods have had a long and fruitful history. The sieve of Eratosthenes (around 3rd century B.C.) was a device to generate prime numbers. Later Legendre used it in his studies of the prime number counting function π(x). Sieve methods bloomed and became a topic of intense investigation after the pioneering work of Viggo Brun (see [Bru16],[Bru19], [Bru22]). Using his formulation of ...
متن کاملSquare-free Strings Over Alphabet Lists
We solve an open problem that was posed in [GKM10]: Given an alphabet list L = L1, . . . , Ln, where |Li| = 3 and 0 ≤ i ≤ n, can we always find a square-free string, W = W1W2 . . .Wn, where Wi ∈ Li? We show that this is indeed the case. We do so using an “offending suffix” characterization of forced repetitions, and a counting, non-constructive, technique. We discuss future directions related t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1107.4890 شماره
صفحات -
تاریخ انتشار 2011